منابع مشابه
Approximate Min-Power Strong Connectivity
Given a directed simple graph G = (V,E) and a cost function c : E → R+, the power of a vertex u in a directed spanning subgraph H is given by pH(u) = maxuv∈E(H) c(uv), and corresponds to the energy consumption required for wireless node u to transmit to all nodes v with uv ∈ E(H). The power of H is given by p(H) = ∑ u∈V pH(u). Power Assignment seeks to minimize p(H) while H satisfies some conne...
متن کامل1.85 Approximation for Min-Power Strong Connectivity
Given a directed simple graph G = (V,E) and a cost function c : E → R+, the power of a vertex u in a directed spanning subgraph H is given by pH(u) = maxuv∈E(H) c(uv), and corresponds to the energy consumption required for wireless node u to transmit to all nodes v with uv ∈ E(H). The power of H is given by p(H) = ∑ u∈V pH(u). Power Assignment seeks to minimize p(H) while H satisfies some conne...
متن کاملStrong connectivity hypothesis and generative power in TAG
Dynamic grammars are relevant for psycholinguistic modelling and speech processing. However, formal treatments of dynamic grammars are rare, and there are few studies that examine the relationship between dynamic and phrase structure grammars. This paper introduces a TAG related dynamic grammar (DVTAG) together with a study of its expressive power. We also shed a new perspective on the wrapping...
متن کاملOn Approximate Min-Max Theorems for Graph Connectivity Problems by Lap
On Approximate Min-Max Theorems for Graph Connectivity Problems Lap Chi Lau Doctor of Philosophy Graduate Department of Computer Science University of Toronto 2006 Given an undirected graph G and a subset of vertices S ⊆ V (G), we call the vertices in S the terminal vertices and the vertices in V (G) − S the Steiner vertices. In this thesis, we study two problems whose goals are to achieve high...
متن کاملMin-Power Covering Problems
In the classical vertex cover problem, we are given a graph G = (V,E) and we aim to find a minimum cardinality cover of the edges, i.e. a subset of the vertices C ⊆ V such that for every edge e ∈ E, at least one of its extremities belongs to C. In the Min-Power-Cover version of the vertex cover problem, we consider an edge-weighted graph and we aim to find a cover of the edges and a valuation (...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2013
ISSN: 0895-4801,1095-7146
DOI: 10.1137/100819540